Markovianity and the Thompson monoid F+
نویسندگان
چکیده
We introduce a new distributional invariance principle, called ‘partial spreadability’, which emerges from the representation theory of Thompson monoid F+ in noncommutative probability spaces. show that partially spreadable sequence random variables is adapted to local Markov filtration. Conversely we large class stationary sequences provides representations F+. In particular case classical space, arrive at de Finetti theorem for with values standard Borel space.
منابع مشابه
Tamari Lattices and the symmetric Thompson monoid
We investigate the connection between Tamari lattices and the Thompson group F , summarized in the fact that F is a group of fractions for a certain monoid F sym whose Cayley graph includes all Tamari lattices. Under this correspondence, the Tamari lattice operations are the counterparts of the least common multiple and greatest common divisor operations in F sym. As an application, we show tha...
متن کاملMonoid generalizations of the Richard Thompson groups
The groups Gk,1 of Richard Thompson and Graham Higman can be generalized in a natural way to monoids, that we call Mk,1, and to inverse monoids, called Invk,1; this is done by simply generalizing bijections to partial functions or partial injective functions. The monoids Mk,1 have connections with circuit complexity (studied in another paper). Here we prove that Mk,1 and Invk,1 are congruence-s...
متن کاملThe - and -Orders of the Thompson-Higman Monoid Mk, 1 and their Complexity
We study the monoid generalizationMk,1 of the Thompson-Higman groups, and we characterize the Rand the L-preorder ofMk,1. Although Mk,1 has only one non-zero J -class and k−1 non-zero D-classes, the Rand the L-preorder are complicated; in particular, <R is dense (even within an L-class), and <L is dense (even within an R-class). We study the computational complexity of the Rand the L-preorder. ...
متن کاملConvexity Properties of Thompson ’ S Group F
We prove that Thompson's group F is not minimally almost convex with respect to any generating set which is a subset of the standard infinite generating set for F and which contains x1. We use this to show that F is not almost convex with respect to any generating set which is a subset of the standard infinite generating set, generalizing results in [HST].
متن کاملThompson ’ s group F ( n ) is not minimally almost convex
We prove that Thompson’s group F (n) is not minimally almost convex with respect to the standard finite generating set. A group G with Cayley graph Γ is not minimally almost convex if for arbitrarily large values of m there exist elements g, h ∈ Bm such that dΓ(g, h) = 2 and dBm (g, h) = 2m. (Here Bm is the ball of radius m centered at the identity.) We use tree-pair diagrams to represent eleme...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Functional Analysis
سال: 2023
ISSN: ['0022-1236', '1096-0783']
DOI: https://doi.org/10.1016/j.jfa.2022.109818